Covering problems for partial words and for indeterminate strings
نویسندگان
چکیده
منابع مشابه
Covering Problems for Partial Words and for Indeterminate Strings
We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don’t care symbol. We prove ...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Conservative String Covering of Indeterminate Strings
We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T [1]T [2] . . . T [n], where T [i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. A conservative indeterminate string, is an indeterminate string where the number of indeterminate symbols in the positions of the string, i.e the non-...
متن کاملUniformities and covering properties for partial frames (I)
Partial frames provide a rich context in which to do pointfree structured and unstructured topology. A small collection of axioms of an elementary nature allows one to do much traditional pointfree topology, both on the level of frames or locales, and that of uniform or metric frames. These axioms are sufficiently general to include as examples bounded distributive...
متن کاملUniformities and covering properties for partial frames (II)
This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.05.026